Genetic algorithms with noisy fitness
نویسندگان
چکیده
منابع مشابه
Simple Genetic Algorithms with Linear Fitness
A general form of stochastic search is described (random heuristic search) and some of its general properties are proved. This provides a framework in which the simple genetic algorithm (SGA) is a special case. The framework is used to illuminate relationships between seemingly diierent probabilistic perspectives of SGA behavior. Next, the SGA is formalized as an instance of random heuristic se...
متن کاملGenetic Algorithms in Noisy Environments
Genetic Algorithms (GA) have been widely used in the areas of searching, function optimization, and machine learning. In many of these applications, the effect of noise is a critical factor in the performance of the genetic algorithms. While it hals been shown in previous siiudies that genetic algorithms are still able to perform effective121 in the presence of noise, tlhe problem of locating t...
متن کاملOptimization of Noisy Fitness Functions by Means of Genetic Algorithms Using History of Search
This paper discusses optimization of functions with uncertainty by means of Genetic Algorithms (GAs). In practical application of such GAs, possible number of fitness evaluation is quite limited. The authors have proposed a GA utilizing history of search (Memory-based Fitness Evaluation GA: MFEGA) so as to reduce the number of fitness evaluation for such applications of GAs. However, it is also...
متن کاملNoisy Fitness Evaluation in Genetic Algorithms and the Dynamics of Learning
A theoretical model is presented which describes selection in a genetic algorithm (GA) under a stochastic fitness measure and correctly accounts for finite population effects. Although this model describes a number of selection schemes, we only consider Boltzmann selection in detail here as results for this form of selection are particularly transparent when fitness is corrupted by additive Gau...
متن کاملDna Simulation of Genetic Algorithms: Fitness Computation1
In this paper a computational mode is presented base on DNA molecules. This model incorporates the theoretical simulation of the principal operations in genetic algorithms. It defines the way of coding of individuals, crossing and the introduction of the individuals so created into the population. It resolves satisfactorily the problems of fitness coding. It shows also the model projection for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical and Computer Modelling
سال: 1996
ISSN: 0895-7177
DOI: 10.1016/0895-7177(96)00068-4